Augmented Block Householder Arnoldi Method
نویسنده
چکیده
Computing the eigenvalues and eigenvectors of a large sparse nonsymmetric matrix arises in many applications and can be a very computationally challenging problem. In this paper we propose the Augmented Block Householder Arnoldi (ABHA) method that combines the advantages of a block routine with an augmented Krylov routine. A public domain MATLAB code ahbeigs has been developed and numerical experiments indicate that the code is competitive with other publicly available codes.
منابع مشابه
A QR-decomposition of block tridiagonal matrices generated by the block Lanczos process
For MinRes and SymmLQ it is essential to compute a QR decomposition of a tridiagonal coefficient matrix gained in the Lanczos process. This QR decomposition is constructed by an update scheme applying in every step a single Givens rotation. Using complex Householder reflections we generalize this idea to block tridiagonal matrices that occur in generalizations of MinRes and SymmLQ to block meth...
متن کاملParametric model order reduction of damped mechanical systems via the block Arnoldi process
This paper proposes a block Arnoldi method for parameterized model order reduction. This method works when design parameters have only low-rank impacts on the system matrix. The method preserves all design parameters in the reduced model and is easy to implement. Numerical results show that the block Arnoldi process outperforms some existing methods up to a factor of ten.
متن کاملCalculation of Pseudospectra by the Arnoldi Iteration
The Amoldi iteration, usually viewed as a method for calculating eigenvalues, can also be used to estimate pseudospectra. This possibility may be of practical importance, because in applications involving highly nonnormal matrices or operators, such as hydrodynamic stability, pseudospectra may be physically more significant than spectra. 1. Introduction. Large-scale nonsymmetric matrix eigenval...
متن کاملA modified harmonic block Arnoldi algorithm with adaptive shifts for large interior eigenproblems
The harmonic block Arnoldi method can be used to find interior eigenpairs of large matrices. Given a target point or shift to which the needed interior eigenvalues are close, the desired interior eigenpairs are the eigenvalues nearest and the associated eigenvectors. However, it has been shown that the harmonic Ritz vectors may converge erratically and even may fail to do so. To do a better job...
متن کاملImplicitly Restarted Arnoldi Methods and Eigenvalues of the Discretized Navier Stokes Equations
Implicitly restarted Arnoldi methods and eigenvalues of the discretized Navier Stokes equations. Abstract We are concerned with nding a few eigenvalues of the large sparse nonsymmetric generalized eigenvalue problem Ax = Bx that arises in stability studies of incompressible uid ow. The matrices have a block structure that is typical of mixed nite-element discretizations for such problems. We ex...
متن کامل